首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   67641篇
  免费   9250篇
  国内免费   7026篇
电工技术   5636篇
技术理论   9篇
综合类   7311篇
化学工业   1590篇
金属工艺   880篇
机械仪表   4370篇
建筑科学   2409篇
矿业工程   1710篇
能源动力   945篇
轻工业   899篇
水利工程   1403篇
石油天然气   3260篇
武器工业   999篇
无线电   11324篇
一般工业技术   3446篇
冶金工业   1242篇
原子能技术   779篇
自动化技术   35705篇
  2024年   168篇
  2023年   918篇
  2022年   1960篇
  2021年   2400篇
  2020年   2530篇
  2019年   2024篇
  2018年   1843篇
  2017年   2303篇
  2016年   2611篇
  2015年   3043篇
  2014年   4715篇
  2013年   4264篇
  2012年   5139篇
  2011年   5443篇
  2010年   4340篇
  2009年   4286篇
  2008年   4753篇
  2007年   5304篇
  2006年   4472篇
  2005年   4013篇
  2004年   3392篇
  2003年   2905篇
  2002年   2192篇
  2001年   1685篇
  2000年   1438篇
  1999年   1063篇
  1998年   809篇
  1997年   680篇
  1996年   530篇
  1995年   498篇
  1994年   405篇
  1993年   286篇
  1992年   204篇
  1991年   200篇
  1990年   160篇
  1989年   127篇
  1988年   101篇
  1987年   71篇
  1986年   68篇
  1985年   97篇
  1984年   74篇
  1983年   88篇
  1982年   70篇
  1981年   45篇
  1980年   23篇
  1979年   42篇
  1978年   18篇
  1977年   24篇
  1976年   20篇
  1959年   8篇
排序方式: 共有10000条查询结果,搜索用时 18 毫秒
1.
A key element in solving real-life data science problems is selecting the types of models to use. Tree ensemble models (such as XGBoost) are usually recommended for classification and regression problems with tabular data. However, several deep learning models for tabular data have recently been proposed, claiming to outperform XGBoost for some use cases. This paper explores whether these deep models should be a recommended option for tabular data by rigorously comparing the new deep models to XGBoost on various datasets. In addition to systematically comparing their performance, we consider the tuning and computation they require. Our study shows that XGBoost outperforms these deep models across the datasets, including the datasets used in the papers that proposed the deep models. We also demonstrate that XGBoost requires much less tuning. On the positive side, we show that an ensemble of deep models and XGBoost performs better on these datasets than XGBoost alone.  相似文献   
2.
In this paper, we present LinkingPark, an automatic semantic annotation system for tabular data to knowledge graph matching. LinkingPark is designed as a modular framework which can handle Cell-Entity Annotation (CEA), Column-Type Annotation (CTA), and Columns-Property Annotation (CPA) altogether. It is built upon our previous SemTab 2020 system, which won the 2nd prize among 28 different teams after four rounds of evaluations. Moreover, the system is unsupervised, stand-alone, and flexible for multilingual support. Its backend offers an efficient RESTful API for programmatic access, as well as an Excel Add-in for ease of use. Users can interact with LinkingPark in near real-time, further demonstrating its efficiency.  相似文献   
3.
Aggregate question answering essentially returns answers for given questions by obtaining query graphs with unique dependencies between values and corresponding objects. Word order dependency, as the key to uniquely identify dependency of the query graph, reflects the dependencies between the words in the question. However, due to the semantic gap caused by the expression difference between questions encoded with word vectors and query graphs represented with logical formal elements, it is not trivial to match the correct query graph for the question. Most existing approaches design more expressive query graphs for complex questions and rank them just by directly calculating their similarities, ignoring the semantic gap between them. In this paper, we propose a novel Structure-sensitive Semantic Matching(SSM) approach that learns aligned representations of dependencies in questions and query graphs to eliminate their gap. First, we propose a cross-structure matching module to bridge the gap between two modalities(i.e., textual question and query graph). Then, we propose an entropy-based gated AQG filter to remove the structural noise caused by the uncertainty of dependencies. Finally, we present a two-channel query graph representation that fuses the semantics of abstract structure and grounding content of the query graph explicitly. Experimental results show that SSM could learn aligned representations of questions and query graphs to eliminate the gaps between their dependencies, and improves up to 12% (F1 score) on aggregation questions of two benchmark datasets.  相似文献   
4.
ABSTRACT

It is important to perform neutron transport simulations with accurate nuclear data in the neutronics design of a fusion reactor. However, absolute values of large-angle scattering cross sections vary among nuclear data libraries even for well-examined nuclide of iron. Benchmark experiments focusing on large-angle scattering cross sections were thus performed to confirm the correctness of nuclear data libraries. The series benchmark experiments were performed at a DT neutron source facility, OKTAVIAN of Osaka University, Japan, by the unique experimental system established by the authors’ group, which can extract only the contribution of large-angle scattering reactions. This system consists of two shadow bars, target plate (iron), and neutron detector (niobium). Two types of shadow bars were used and four irradiations were conducted for one experiment, so that contribution of room-return neutrons was effectively removed and only large-angle scattering neutrons were extracted from the measured four Nb reaction rates. The obtained experimental results were compared with calculations for five nuclear data libraries including JENDL-4.0, JEFF.-3.3, FENDL-3.1, ENDF/B- VII, and recently released ENDF/B-VIII. It was found from the comparison that ENDF/B-VIII showed the best result, though ENDF/B-VII showed overestimation and others are in large underestimation at 14 MeV.  相似文献   
5.
随着海洋资源勘探和海洋污染物监控工作的开展,水文数据的监测和采集等已经成为重要的研究方向。其中,水下无线传感器网络在水文数据采集过程中起着举足轻重的作用。本文研究的是水下无线传感器二维监测网络模型中,传感器节点数据采集的问题,其设计方法是通过自组织映射(Self-organizing mapping,SOM)对传感器节点进行路径最优化处理,结合优化的路径图形和K-means算法找到路径内部聚合点,利用聚合点和传感器的节点得到传感器通信半径内的数据采集点,最后通过SOM得到水下机器人(Autonomous underwater vehicle,AUV)到各个数据采集点采集数据的最优路径。经过实验验证,在水下1 200 m×1 750 m范围内布置52个传感器节点的情景下,数据采集点相比于传感器节点路径规划采用相同的采集顺序得到的路径优化了6.7%;对数据采集点重新进行自组织路径规划得到的路径比传感器结点路径的最优解提高了12.2%。增加传感器节点的数量,其结果也大致相同,因此采用该方法可以提高水下机器人采集数据的效率。  相似文献   
6.
7.
Machine learning-based fault detection methods are frequently combined with wavelet transform (WT) to detect an unintentional islanding condition. In contrast to this condition, these methods have long detection and computation time. Thus, selecting a useful signal processing-based approach is required for reliable islanding detection, especially in real-time applications. This paper presents a new modified signal processing-based islanding detection method (IDM) for real-time applications of hydrogen energy-based distributed generators. In the study, a new IDM using a modified pyramidal algorithm approach with an undecimated wavelet transform (UWT) is presented. The proposed method is performed with different grid conditions with the presence of electric noise in real-time. Experimental results show that oscillations in the acquired signal can be reduced by the UWT, and noise sensitivity is lower than other WT-based methods. The non-detection zone is zero and the maximum detection and computational time is also 75 ms at a close power match.  相似文献   
8.
文猛  张释如 《包装工程》2022,43(21):162-168
目的 为了解决目前三维数据隐藏算法不能兼顾无失真和盲提取的问题,提出一种新的完全无失真的三维网格模型数据隐藏盲算法。方法 首先使用混沌逻辑映射选择嵌入与提取模式,保证数据的安全性。然后利用面元素重排,完全不会造成三维模型失真的性质,通过不同嵌入模式规则对三角面元素进行重排,以嵌入秘密数据。接收端则可根据相应的提取模式规则提取秘密数据。结果 仿真结果与分析表明,该算法不会对三维模型造成任何失真,嵌入容量为每顶点2比特,且能抵抗仿射变换攻击、噪声攻击和平滑攻击等。结论 这种三维数据隐藏盲算法无失真,容量大、安全性高、鲁棒性强,适用于三维载体不容修改的情形,如军事、医学、秘密通信和版权保护等。  相似文献   
9.
概述了侧围加强内框总成与周边零件的匹配关系,从检具操作的人机工程出发,描述了侧围加强内框总成检具的2种定位方式和结构设计,对比了2种定位方式对于检测结果的影响,总结了其优点和弊端,结果表明侧围加强内框总成检具采用车内方向朝下的定位方式效果更好。  相似文献   
10.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号